This text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, an...(展开全部)

This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety ...(展开全部)

This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety ...(展开全部)

Complexity theory is a central field of the theoretical foundations of computer science. It is concerned with the general study of the intrinsic complexity of computational tasks; that is, it addresses the question of what can be achieved within limited time (and/or with other limited natural computational resources). This book offers a conceptual perspective on complexity theo...(展开全部)

This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety ...(展开全部)

Many aspects of the internal and external workings of computers can be viewed as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It is also often used as an abstract model of other aspects of computation. This book surveys this mathematical theory, concentrating on the question of how much communication i...(展开全部)

Allen B. Downey拥有加州大学伯克利分校的计算机科学博土学位和MIT的硕士与学土学位，现任美国欧林工程学院计算机科学系的教授，曾经在威尔斯利大学、科尔比学院和加州大学伯克利分校教授计算机科学相关的课程。曾经担任 Google的访问科学家，对复杂性科学和Python十分着迷，有较为深入的研究和丰富的实践经验。

This second edition describes the computational methods used in theoretical physics, and has been fully updated. New sections have been added to cover finite element methods and lattice Boltzmann simulation, density functional theory, quantum molecular dynamics, Monte Carlo simulation, and diagonalisation of one-dimensional quantum systems. It covers many different areas of phy...(展开全部)

Computional physics involves the use of computer calculations and simulations to solve physical problems. This book describes computational methods used in theoretical physics with emphasis on condensed matter applications. Coverage begins with an overview of the wide variety of topics and algorithmic approaches studied in this book. The next chapters concentrate on electronic ...(展开全部)

Retaining the general organization and style of its predecessor, this new edition continues to serve as a comprehensive guide to modern and classical methods of statistical computing and computational statistics. Approaching the topic in three major parts--optimization, integration, and smoothing--the book includes an overview section in each chapter introduction and step-by-st...(展开全部)